Recursive Euler and Hamilton paths
نویسندگان
چکیده
منابع مشابه
Euler paths and ends in automatic and recursive graphs
It is shown that the existence of an Euler path in a recursive graph is complete for the class DΣ 3 of all set differences of two Σ 3 sets. The same problem for highly recursive graphs as well as automatic graphs is shown to be Π 2 -complete. Moreover, the arithmetic level for bounding the number of ends in an automatic/recursive graph as well as computing the number of infinite paths in an aut...
متن کاملM-alternating Hamilton paths and M-alternating Hamilton cycles
We study M-alternating Hamilton paths, and M-alternating Hamilton cycles in a simple connected graph G on ν vertices with a perfect matchingM . Let G be a bipartite graph, we prove that if for any two vertices x and y in different parts of G, d(x)+d(y) ≥ ν/2+2, then G has an M-alternating Hamilton cycle. For general graphs, a condition for the existence of an M-alternating Hamilton path startin...
متن کاملEuler Circuits and Paths 1
Let D be a set, let T be a non empty set of finite sequences of D, and let S be a non empty subset of T . We see that the element of S is a finite sequence of elements of D. Let i, j be even integers. One can verify that i − j is even. We now state two propositions: (1) For all integers i, j holds i is even iff j is even iff i − j is even. (2) Let p be a finite sequence and m, n, a be natural n...
متن کاملHamilton Paths in Grid Graphs
A grid graph is a node-induced finite subgraph of the infinite grid. It is rectangular if its set of nodes is the product of two intervals. Given a rectangular grid graph and two of its nodes, we give necessary and sufficient conditions for the graph to have a Hamilton path between these two nodes. In contrast, the Hamilton path (and circuit) problem for general grid graphs is shown to be NP-co...
متن کاملHamilton paths in toroidal graphs
Tutte has shown that every 4-connected planar graph contains a Hamilton cycle. Grünbaum and Nash-Williams independently conjectured that the same is true for toroidal graphs. In this paper, we prove that every 4-connected toroidal graph contains a Hamilton path. Partially supported by NSF grant DMS-9970514 Partially supported by NSF grants DMS-9970527 and DMS-0245530 Partially supported by RGC ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1976
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1976-0416888-0